Scheduling Multisource Divisible Loads on Arbitrary Networks
نویسندگان
چکیده
منابع مشابه
A Strategyproof Mechanism for Scheduling Divisible Loads in Tree Networks
The underlying assumption of Divisible Load Scheduling is that the processors composing the network are obedient, i.e., they do not “cheat” the algorithm. This assumption is unrealistic if the processors are owned by autonomous, self-interested organizations that have no a priori motivation for cooperation and they will manipulate the algorithm if it is beneficial to do so. In this paper we pro...
متن کاملGrid scheduling divisible loads from two sources
To date closed form solutions for optimal finish time and job allocation are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for single level tree networks w...
متن کاملOn the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks
ÐOptimal distribution of divisible loads in bus networks is considered in this paper. The problem of minimizing the processing time is investigated by including all the overhead components that could penalize the performance of the system, in addition to the inherent communication and computation delays. These overheads are considered to be constant additive factors to the respective communicat...
متن کاملSuboptimal solutions using integer approximation techniques for scheduling divisible loads on distributed bus networks
The problem of optimal divisible load distribution in distributed bus networks employing a heterogeneous cluster of processors is addressed. The objective is to minimize the total processing time of the entire load subject to the communication and computation delays. In the mathematical model we adopt, both the granularity of the load fractions and all the associated overheads (also referred to...
متن کاملReal-time scheduling of divisible loads in cluster computing environments
Cluster computing has become an important paradigm for solving large-scale problems. To enhance the quality of service (QoS) and provide performance guarantees in a cluster computing environment, various real-time scheduling algorithms and workload models have been investigated. Computational loads that can be arbitrarily divided into independent tasks represent many real-world applications. Ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2010
ISSN: 1045-9219
DOI: 10.1109/tpds.2009.62